A Variety Theorem for Relational Universal Algebra
نویسندگان
چکیده
We develop an analogue of universal algebra in which generating symbols are interpreted as relations. prove a variety theorem for these relational algebraic theories, we find that their categories models precisely the definable categories. The syntax our theories is string-diagrammatic, and can be seen extension usual term theories.
منابع مشابه
Relational lattices: From databases to universal algebra
Relational lattices are obtained by interpreting lattice connectives as natural join and inner union between database relations. Our study of their equational theory reveals that the variety generated by relational lattices has not been discussed in the existing literature. Furthermore, we show that addition of just the header constant to the lattice signature leads to undecidability of the qua...
متن کاملA relational algebra for SPARQL
The SPARQL query language for RDF provides Semantic Web developers with a powerful tool to extract information from large datasets. This report describes a transformation from SPARQL into the relational algebra, an abstract intermediate language for the expression and analysis of queries. This makes existing work on query planning and optimization available to SPARQL implementors. A further tra...
متن کاملUniversal Algebra for Logics
These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic in Montreux. They cannot be recommended for self studies because, although all definitions and main ideas are included, there are no proofs and examples. I’m going to provide some of them during my lectures, leaving easy ones as exercises. In the first part we discuss some of the most important n...
متن کاملA variety theorem without complementation
The most important tool for classifying recognizable languages is Eilenberg’s variety theorem [1], which gives a one-to-one correspondence between (pseudo)-varieties of finite semigroups and varieties of recognizable languages. Varieties of recognizable languages are classes of recognizable languages closed under union, intersection, complement, left and right quotients and inverse morphisms. R...
متن کاملA Temporal Relational Algebra as Basis for Temporal Relational Completeness
We define a tenlporal algebra that is applicable to any temporal relational data model supporting discrete linear bounded time. This algebra has the five basic relational algebra operators extended to the temporal domain and an operator of linear recursion. We show that this algebra has the expressive power of a safe temporal calculus based on the predicate temporal logic with the until and sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88701-8_22